Potential Theoretic Approach to Rendezvous Numbers
نویسندگان
چکیده
منابع مشابه
Potential theoretic approach to rendezvous numbers
We analyze relations between various forms of energies (reciprocal capacities), the transfinite diameter, various Chebyshev constants and the so-called rendezvous or average number. The latter is originally defined for compact connected metric spaces (X, d) as the (in this case unique) nonnegative real number r with the property that for arbitrary finite point systems {x1, . . . , xn} ⊂ X, ther...
متن کاملM ar 2 00 5 RENDEZVOUS NUMBERS OF METRIC SPACES – A POTENTIAL THEORETIC APPROACH
The present work draws on the understanding how notions of general potential theory – as set up, e.g., by Fuglede – explain existence and some basic results on the " magical " rendezvous numbers. We aim at a fairly general description of rendezvous numbers in a metric space by using systematically the potential theoretic approach. In particular, we generalize and explain results on invariant me...
متن کاملA graph-theoretic approach to quasigroup cycle numbers
Norton and Stein associated a number with each idempotent quasigroup or diagonalized Latin square of given finite order n, showing that it is congruent mod 2 to the triangular number T (n). In this paper, we use a graph-theoretic approach to extend their invariant to an arbitrary finite quasigroup. We call it the cycle number, and identify it as the number of connected components in a certain g...
متن کاملnon-corrective approach to pronunciation
the aim of this study has been to find answers for the following questions: 1. what is the effect of immediate correction on students pronunciation errors? 2. what would be the effect of teaching the more rgular patterns of english pronunciation? 3. is there any significant difference between the two methods of dealing with pronuciation errore, i. e., correction and the teaching of the regular ...
15 صفحه اولPCF extended with real numbers : a domain-theoretic approach to higher-order exact real number computation
We develop a theory of higher-order exact real number computation based on Scott domain theory. Our main object of investigation is a higher-order functional programming language, Real PCF, which is an extension of PCF with a data type for real numbers and constants for primitive real functions. Real PCF has both operational and denotational semantics, related by a computational adequacy proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monatshefte für Mathematik
سال: 2006
ISSN: 0026-9255,1436-5081
DOI: 10.1007/s00605-006-0397-5